A Force-Directed Algorithm for Drawing Directed Graphs Symmetrically

Force-Directed Drawing Algorithms

University of Arizona 5.

A Multilevel Algorithm for Force-Directed Graph Drawing

A Multilevel Algorithm for Force-Directed Graph-Drawing

We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement algorithm. The multilevel technique matches and coalesces pairs of adjacent vertices to define a new graph and is repeated recursively to create a hierarchy of increasingly coarse graphs, G0, G1, . . . , GL. The coarsest graph, GL, is then given an initial layout and the ...

A Technique for Drawing Directed Graphs

We describe a four-pass algorithm for drawing directed graphs. The first pass finds an optimal rank assignment using a network simplex algorithm. The second pass sets the vertex order within ranks by an iterative heuristic incorporating a novel weight function and local transpositions to reduce crossings. The third pass finds optimal coordinates for nodes by constructing and ranking an auxiliar...

Heuristics and pedigrees for drawing directed graphs

We describe here a collection of heuristics for producing “nice”drawings of directed graphs, and a simple dual-mode software tool for testing and evaluating them. In playing mode, the heuristics are applied in random sequence over a set of drawings, in the manner of an asynchronous team (A-team). As new drawings are added to the set, others are deleted based on a multi-valued aesthetic evaluati...